TSTP Solution File: NUM652^4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM652^4 : TPTP v8.1.2. Released v7.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:55:58 EDT 2024
% Result : Theorem 0.40s 0.66s
% Output : CNFRefutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 51
% Syntax : Number of formulae : 111 ( 63 unt; 29 typ; 0 def)
% Number of atoms : 678 ( 144 equ; 0 cnn)
% Maximal formula atoms : 275 ( 8 avg)
% Number of connectives : 1452 ( 362 ~; 295 |; 43 &; 561 @)
% ( 0 <=>; 191 =>; 0 <=; 0 <~>)
% Maximal formula depth : 50 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 75 ( 75 >; 0 *; 0 +; 0 <<)
% Number of symbols : 32 ( 29 usr; 7 con; 0-3 aty)
% Number of variables : 184 ( 133 ^ 51 !; 0 ?; 184 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
is_of: $i > ( $i > $o ) > $o ).
thf(decl_23,type,
all_of: ( $i > $o ) > ( $i > $o ) > $o ).
thf(decl_25,type,
in: $i > $i > $o ).
thf(decl_61,type,
imp: $o > $o > $o ).
thf(decl_62,type,
d_not: $o > $o ).
thf(decl_65,type,
l_ec: $o > $o > $o ).
thf(decl_66,type,
d_and: $o > $o > $o ).
thf(decl_67,type,
l_or: $o > $o > $o ).
thf(decl_71,type,
non: $i > ( $i > $o ) > $i > $o ).
thf(decl_72,type,
l_some: $i > ( $i > $o ) > $o ).
thf(decl_73,type,
or3: $o > $o > $o > $o ).
thf(decl_74,type,
and3: $o > $o > $o > $o ).
thf(decl_75,type,
ec3: $o > $o > $o > $o ).
thf(decl_76,type,
orec3: $o > $o > $o > $o ).
thf(decl_77,type,
e_is: $i > $i > $i > $o ).
thf(decl_123,type,
nat: $i ).
thf(decl_124,type,
n_is: $i > $i > $o ).
thf(decl_127,type,
n_some: ( $i > $o ) > $o ).
thf(decl_142,type,
n_pl: $i > $i > $i ).
thf(decl_147,type,
diffprop: $i > $i > $i > $o ).
thf(decl_148,type,
d_29_ii: $i > $i > $o ).
thf(decl_149,type,
iii: $i > $i > $o ).
thf(decl_151,type,
moreis: $i > $i > $o ).
thf(decl_153,type,
esk1_0: $i ).
thf(decl_154,type,
esk2_0: $i ).
thf(decl_155,type,
esk3_0: $i ).
thf(decl_156,type,
esk4_0: $i ).
thf(decl_157,type,
esk5_2: $i > $i > $i ).
thf(decl_158,type,
esk6_2: $i > $i > $i ).
thf(def_d_not,axiom,
( d_not
= ( ^ [X76: $o] : ( imp @ X76 @ ~ $true ) ) ),
file('/export/starexec/sandbox/tmp/tmp.z32LRPxeQy/E---3.1_17846.p',def_d_not) ).
thf(def_imp,axiom,
( imp
= ( ^ [X74: $o,X75: $o] :
( X74
=> X75 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.z32LRPxeQy/E---3.1_17846.p',def_imp) ).
thf(def_l_ec,axiom,
( l_ec
= ( ^ [X79: $o,X80: $o] : ( imp @ X79 @ ( d_not @ X80 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.z32LRPxeQy/E---3.1_17846.p',def_l_ec) ).
thf(def_all_of,axiom,
( all_of
= ( ^ [X3: $i > $o,X2: $i > $o] :
! [X4: $i] :
( ( is_of @ X4 @ X3 )
=> ( X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.z32LRPxeQy/E---3.1_17846.p',def_all_of) ).
thf(def_is_of,axiom,
( is_of
= ( ^ [X1: $i,X2: $i > $o] : ( X2 @ X1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.z32LRPxeQy/E---3.1_17846.p',def_is_of) ).
thf(def_non,axiom,
( non
= ( ^ [X1: $i,X2: $i > $o,X4: $i] : ( d_not @ ( X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.z32LRPxeQy/E---3.1_17846.p',def_non) ).
thf(def_d_and,axiom,
( d_and
= ( ^ [X81: $o,X82: $o] : ( d_not @ ( l_ec @ X81 @ X82 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.z32LRPxeQy/E---3.1_17846.p',def_d_and) ).
thf(def_l_some,axiom,
( l_some
= ( ^ [X1: $i,X2: $i > $o] :
( d_not
@ ( all_of
@ ^ [X4: $i] : ( in @ X4 @ X1 )
@ ( non @ X1 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.z32LRPxeQy/E---3.1_17846.p',def_l_some) ).
thf(def_e_is,axiom,
( e_is
= ( ^ [X1: $i,X101: $i,X102: $i] : ( X101 = X102 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.z32LRPxeQy/E---3.1_17846.p',def_e_is) ).
thf(def_l_or,axiom,
( l_or
= ( ^ [X83: $o] : ( imp @ ( d_not @ X83 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.z32LRPxeQy/E---3.1_17846.p',def_l_or) ).
thf(def_and3,axiom,
( and3
= ( ^ [X92: $o,X93: $o,X94: $o] : ( d_and @ X92 @ ( d_and @ X93 @ X94 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.z32LRPxeQy/E---3.1_17846.p',def_and3) ).
thf(def_diffprop,axiom,
( diffprop
= ( ^ [X1: $i,X207: $i,X4: $i] : ( n_is @ X1 @ ( n_pl @ X207 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.z32LRPxeQy/E---3.1_17846.p',def_diffprop) ).
thf(def_n_is,axiom,
( n_is
= ( ^ [Z0: $i,Z1: $i] : ( Z0 = Z1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.z32LRPxeQy/E---3.1_17846.p',def_n_is) ).
thf(def_or3,axiom,
( or3
= ( ^ [X89: $o,X90: $o,X91: $o] : ( l_or @ X89 @ ( l_or @ X90 @ X91 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.z32LRPxeQy/E---3.1_17846.p',def_or3) ).
thf(def_ec3,axiom,
( ec3
= ( ^ [X95: $o,X96: $o,X97: $o] : ( and3 @ ( l_ec @ X95 @ X96 ) @ ( l_ec @ X96 @ X97 ) @ ( l_ec @ X97 @ X95 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.z32LRPxeQy/E---3.1_17846.p',def_ec3) ).
thf(def_d_29_ii,axiom,
( d_29_ii
= ( ^ [X1: $i,X210: $i] : ( n_some @ ( diffprop @ X1 @ X210 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.z32LRPxeQy/E---3.1_17846.p',def_d_29_ii) ).
thf(def_n_some,axiom,
( n_some
= ( ^ [Z0: $i > $o] :
( ! [X330: $i] :
( ( in @ X330 @ nat )
=> ( ( Z0 @ X330 )
=> ~ $true ) )
=> ~ $true ) ) ),
file('/export/starexec/sandbox/tmp/tmp.z32LRPxeQy/E---3.1_17846.p',def_n_some) ).
thf(def_orec3,axiom,
( orec3
= ( ^ [X98: $o,X99: $o,X100: $o] : ( d_and @ ( or3 @ X98 @ X99 @ X100 ) @ ( ec3 @ X98 @ X99 @ X100 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.z32LRPxeQy/E---3.1_17846.p',def_orec3) ).
thf(def_iii,axiom,
( iii
= ( ^ [X1: $i,X211: $i] : ( n_some @ ( diffprop @ X211 @ X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.z32LRPxeQy/E---3.1_17846.p',def_iii) ).
thf(def_moreis,axiom,
( moreis
= ( ^ [X1: $i,X229: $i] : ( l_or @ ( d_29_ii @ X1 @ X229 ) @ ( n_is @ X1 @ X229 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.z32LRPxeQy/E---3.1_17846.p',def_moreis) ).
thf(satz10,axiom,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] :
( all_of
@ ^ [X219: $i] : ( in @ X219 @ nat )
@ ^ [X220: $i] : ( orec3 @ ( n_is @ X1 @ X220 ) @ ( d_29_ii @ X1 @ X220 ) @ ( iii @ X1 @ X220 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.z32LRPxeQy/E---3.1_17846.p',satz10) ).
thf(satz10c,conjecture,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] :
( all_of
@ ^ [X235: $i] : ( in @ X235 @ nat )
@ ^ [X236: $i] :
( ( moreis @ X1 @ X236 )
=> ( d_not @ ( iii @ X1 @ X236 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.z32LRPxeQy/E---3.1_17846.p',satz10c) ).
thf(c_0_22,plain,
( d_not
= ( ^ [Z0: $o] :
( Z0
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_d_not]) ).
thf(c_0_23,plain,
( imp
= ( ^ [Z0: $o,Z1: $o] :
( Z0
=> Z1 ) ) ),
inference(fof_simplification,[status(thm)],[def_imp]) ).
thf(c_0_24,plain,
( l_ec
= ( ^ [Z0: $o,Z1: $o] :
( Z0
=> ( Z1
=> ~ $true ) ) ) ),
inference(fof_simplification,[status(thm)],[def_l_ec]) ).
thf(c_0_25,plain,
( d_not
= ( ^ [Z0: $o] :
( Z0
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[c_0_22,c_0_23]) ).
thf(c_0_26,plain,
( all_of
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X4: $i] :
( ( Z0 @ X4 )
=> ( Z1 @ X4 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_all_of]) ).
thf(c_0_27,plain,
( is_of
= ( ^ [Z0: $i,Z1: $i > $o] : ( Z1 @ Z0 ) ) ),
inference(fof_simplification,[status(thm)],[def_is_of]) ).
thf(c_0_28,plain,
( non
= ( ^ [Z0: $i,Z1: $i > $o,Z2: $i] :
( ( Z1 @ Z2 )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_non]) ).
thf(c_0_29,plain,
( d_and
= ( ^ [Z0: $o,Z1: $o] :
( ( Z0
=> ( Z1
=> ~ $true ) )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_d_and]) ).
thf(c_0_30,plain,
( l_ec
= ( ^ [Z0: $o,Z1: $o] :
( Z0
=> ( Z1
=> ~ $true ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_24,c_0_25]),c_0_23]) ).
thf(c_0_31,plain,
( l_some
= ( ^ [Z0: $i,Z1: $i > $o] :
( ! [X313: $i] :
( ( in @ X313 @ Z0 )
=> ( ( Z1 @ X313 )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_l_some]) ).
thf(c_0_32,plain,
( all_of
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X4: $i] :
( ( Z0 @ X4 )
=> ( Z1 @ X4 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_26,c_0_27]) ).
thf(c_0_33,plain,
( non
= ( ^ [Z0: $i,Z1: $i > $o,Z2: $i] :
( ( Z1 @ Z2 )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[c_0_28,c_0_25]) ).
thf(c_0_34,plain,
( e_is
= ( ^ [Z0: $i,Z1: $i,Z2: $i] : ( Z1 = Z2 ) ) ),
inference(fof_simplification,[status(thm)],[def_e_is]) ).
thf(c_0_35,plain,
( l_or
= ( ^ [Z0: $o,Z1: $o] :
( ( Z0
=> ~ $true )
=> Z1 ) ) ),
inference(fof_simplification,[status(thm)],[def_l_or]) ).
thf(c_0_36,plain,
( and3
= ( ^ [Z0: $o,Z1: $o,Z2: $o] :
( ( Z0
=> ( ( ( Z1
=> ( Z2
=> ~ $true ) )
=> ~ $true )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_and3]) ).
thf(c_0_37,plain,
( d_and
= ( ^ [Z0: $o,Z1: $o] :
( ( Z0
=> ( Z1
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_29,c_0_25]),c_0_30]) ).
thf(c_0_38,plain,
( l_some
= ( ^ [Z0: $i,Z1: $i > $o] :
( ! [X313: $i] :
( ( in @ X313 @ Z0 )
=> ( ( Z1 @ X313 )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_31,c_0_25]),c_0_32]),c_0_33]) ).
thf(c_0_39,plain,
( diffprop
= ( ^ [Z0: $i,Z1: $i,Z2: $i] :
( Z0
= ( n_pl @ Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_diffprop]) ).
thf(c_0_40,axiom,
( n_is
= ( ^ [Z0: $i,Z1: $i] : ( Z0 = Z1 ) ) ),
inference(apply_def,[status(thm)],[def_n_is,c_0_34]) ).
thf(c_0_41,plain,
( or3
= ( ^ [Z0: $o,Z1: $o,Z2: $o] :
( ( Z0
=> ~ $true )
=> ( ( Z1
=> ~ $true )
=> Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_or3]) ).
thf(c_0_42,plain,
( l_or
= ( ^ [Z0: $o,Z1: $o] :
( ( Z0
=> ~ $true )
=> Z1 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_35,c_0_25]),c_0_23]) ).
thf(c_0_43,plain,
( ec3
= ( ^ [Z0: $o,Z1: $o,Z2: $o] :
( ( ( Z0
=> ( Z1
=> ~ $true ) )
=> ( ( ( ( Z1
=> ( Z2
=> ~ $true ) )
=> ( ( Z2
=> ( Z0
=> ~ $true ) )
=> ~ $true ) )
=> ~ $true )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_ec3]) ).
thf(c_0_44,plain,
( and3
= ( ^ [Z0: $o,Z1: $o,Z2: $o] :
( ( Z0
=> ( ( ( Z1
=> ( Z2
=> ~ $true ) )
=> ~ $true )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[c_0_36,c_0_37]) ).
thf(c_0_45,plain,
( d_29_ii
= ( ^ [Z0: $i,Z1: $i] :
( ! [X337: $i] :
( ( in @ X337 @ nat )
=> ( ( Z0
= ( n_pl @ Z1 @ X337 ) )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_d_29_ii]) ).
thf(c_0_46,axiom,
( n_some
= ( ^ [Z0: $i > $o] :
( ! [X330: $i] :
( ( in @ X330 @ nat )
=> ( ( Z0 @ X330 )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[def_n_some,c_0_38]) ).
thf(c_0_47,plain,
( diffprop
= ( ^ [Z0: $i,Z1: $i,Z2: $i] :
( Z0
= ( n_pl @ Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_39,c_0_40]) ).
thf(c_0_48,plain,
( orec3
= ( ^ [Z0: $o,Z1: $o,Z2: $o] :
( ( ( ( Z0
=> ~ $true )
=> ( ( Z1
=> ~ $true )
=> Z2 ) )
=> ( ( ( ( Z0
=> ( Z1
=> ~ $true ) )
=> ( ( ( ( Z1
=> ( Z2
=> ~ $true ) )
=> ( ( Z2
=> ( Z0
=> ~ $true ) )
=> ~ $true ) )
=> ~ $true )
=> ~ $true ) )
=> ~ $true )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_orec3]) ).
thf(c_0_49,plain,
( or3
= ( ^ [Z0: $o,Z1: $o,Z2: $o] :
( ( Z0
=> ~ $true )
=> ( ( Z1
=> ~ $true )
=> Z2 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_41,c_0_42]) ).
thf(c_0_50,plain,
( ec3
= ( ^ [Z0: $o,Z1: $o,Z2: $o] :
( ( ( Z0
=> ( Z1
=> ~ $true ) )
=> ( ( ( ( Z1
=> ( Z2
=> ~ $true ) )
=> ( ( Z2
=> ( Z0
=> ~ $true ) )
=> ~ $true ) )
=> ~ $true )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_43,c_0_44]),c_0_30]) ).
thf(c_0_51,plain,
( iii
= ( ^ [Z0: $i,Z1: $i] :
( ! [X338: $i] :
( ( in @ X338 @ nat )
=> ( ( Z1
= ( n_pl @ Z0 @ X338 ) )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_iii]) ).
thf(c_0_52,plain,
( d_29_ii
= ( ^ [Z0: $i,Z1: $i] :
( ! [X337: $i] :
( ( in @ X337 @ nat )
=> ( ( Z0
= ( n_pl @ Z1 @ X337 ) )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_45,c_0_46]),c_0_47]) ).
thf(c_0_53,plain,
( orec3
= ( ^ [Z0: $o,Z1: $o,Z2: $o] :
( ( ( ( Z0
=> ~ $true )
=> ( ( Z1
=> ~ $true )
=> Z2 ) )
=> ( ( ( ( Z0
=> ( Z1
=> ~ $true ) )
=> ( ( ( ( Z1
=> ( Z2
=> ~ $true ) )
=> ( ( Z2
=> ( Z0
=> ~ $true ) )
=> ~ $true ) )
=> ~ $true )
=> ~ $true ) )
=> ~ $true )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_37]) ).
thf(c_0_54,plain,
( iii
= ( ^ [Z0: $i,Z1: $i] :
( ! [X338: $i] :
( ( in @ X338 @ nat )
=> ( ( Z1
= ( n_pl @ Z0 @ X338 ) )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_51,c_0_46]),c_0_47]) ).
thf(c_0_55,plain,
( moreis
= ( ^ [Z0: $i,Z1: $i] :
( ( ( ! [X339: $i] :
( ( in @ X339 @ nat )
=> ( ( Z0
= ( n_pl @ Z1 @ X339 ) )
=> ~ $true ) )
=> ~ $true )
=> ~ $true )
=> ( Z0 = Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_moreis]) ).
thf(c_0_56,plain,
! [X369: $i] :
( ( in @ X369 @ nat )
=> ! [X368: $i] :
( ( in @ X368 @ nat )
=> ( ( ( ( ( X369 = X368 )
=> ~ $true )
=> ( ( ( ! [X366: $i] :
( ( in @ X366 @ nat )
=> ( ( X369
= ( n_pl @ X368 @ X366 ) )
=> ~ $true ) )
=> ~ $true )
=> ~ $true )
=> ( ! [X367: $i] :
( ( in @ X367 @ nat )
=> ( ( X368
= ( n_pl @ X369 @ X367 ) )
=> ~ $true ) )
=> ~ $true ) ) )
=> ( ( ( ( ( X369 = X368 )
=> ( ( ! [X366: $i] :
( ( in @ X366 @ nat )
=> ( ( X369
= ( n_pl @ X368 @ X366 ) )
=> ~ $true ) )
=> ~ $true )
=> ~ $true ) )
=> ( ( ( ( ( ! [X366: $i] :
( ( in @ X366 @ nat )
=> ( ( X369
= ( n_pl @ X368 @ X366 ) )
=> ~ $true ) )
=> ~ $true )
=> ( ( ! [X367: $i] :
( ( in @ X367 @ nat )
=> ( ( X368
= ( n_pl @ X369 @ X367 ) )
=> ~ $true ) )
=> ~ $true )
=> ~ $true ) )
=> ( ( ( ! [X367: $i] :
( ( in @ X367 @ nat )
=> ( ( X368
= ( n_pl @ X369 @ X367 ) )
=> ~ $true ) )
=> ~ $true )
=> ( ( X369 = X368 )
=> ~ $true ) )
=> ~ $true ) )
=> ~ $true )
=> ~ $true ) )
=> ~ $true )
=> ~ $true ) )
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz10]),c_0_52]),c_0_32]),c_0_53]),c_0_40]),c_0_54]) ).
thf(c_0_57,plain,
( moreis
= ( ^ [Z0: $i,Z1: $i] :
( ( ( ! [X339: $i] :
( ( in @ X339 @ nat )
=> ( ( Z0
= ( n_pl @ Z1 @ X339 ) )
=> ~ $true ) )
=> ~ $true )
=> ~ $true )
=> ( Z0 = Z1 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_55,c_0_52]),c_0_40]),c_0_42]) ).
thf(c_0_58,plain,
! [X490: $i,X491: $i,X494: $i,X495: $i,X496: $i,X497: $i] :
( ( ( in @ ( esk6_2 @ X490 @ X491 ) @ nat )
| ~ $true
| ( in @ ( esk5_2 @ X490 @ X491 ) @ nat )
| ~ $true
| ( X490 = X491 )
| ~ $true
| ~ ( in @ X491 @ nat )
| ~ ( in @ X490 @ nat ) )
& ( ( X491
= ( n_pl @ X490 @ ( esk6_2 @ X490 @ X491 ) ) )
| ~ $true
| ( in @ ( esk5_2 @ X490 @ X491 ) @ nat )
| ~ $true
| ( X490 = X491 )
| ~ $true
| ~ ( in @ X491 @ nat )
| ~ ( in @ X490 @ nat ) )
& ( $true
| ~ $true
| ( in @ ( esk5_2 @ X490 @ X491 ) @ nat )
| ~ $true
| ( X490 = X491 )
| ~ $true
| ~ ( in @ X491 @ nat )
| ~ ( in @ X490 @ nat ) )
& ( ( in @ ( esk6_2 @ X490 @ X491 ) @ nat )
| ~ $true
| ( X490
= ( n_pl @ X491 @ ( esk5_2 @ X490 @ X491 ) ) )
| ~ $true
| ( X490 = X491 )
| ~ $true
| ~ ( in @ X491 @ nat )
| ~ ( in @ X490 @ nat ) )
& ( ( X491
= ( n_pl @ X490 @ ( esk6_2 @ X490 @ X491 ) ) )
| ~ $true
| ( X490
= ( n_pl @ X491 @ ( esk5_2 @ X490 @ X491 ) ) )
| ~ $true
| ( X490 = X491 )
| ~ $true
| ~ ( in @ X491 @ nat )
| ~ ( in @ X490 @ nat ) )
& ( $true
| ~ $true
| ( X490
= ( n_pl @ X491 @ ( esk5_2 @ X490 @ X491 ) ) )
| ~ $true
| ( X490 = X491 )
| ~ $true
| ~ ( in @ X491 @ nat )
| ~ ( in @ X490 @ nat ) )
& ( ( in @ ( esk6_2 @ X490 @ X491 ) @ nat )
| ~ $true
| $true
| ~ $true
| ( X490 = X491 )
| ~ $true
| ~ ( in @ X491 @ nat )
| ~ ( in @ X490 @ nat ) )
& ( ( X491
= ( n_pl @ X490 @ ( esk6_2 @ X490 @ X491 ) ) )
| ~ $true
| $true
| ~ $true
| ( X490 = X491 )
| ~ $true
| ~ ( in @ X491 @ nat )
| ~ ( in @ X490 @ nat ) )
& ( $true
| ~ $true
| $true
| ~ $true
| ( X490 = X491 )
| ~ $true
| ~ ( in @ X491 @ nat )
| ~ ( in @ X490 @ nat ) )
& ( ( in @ ( esk6_2 @ X490 @ X491 ) @ nat )
| ~ $true
| $true
| ( X490 = X491 )
| ~ $true
| ~ ( in @ X491 @ nat )
| ~ ( in @ X490 @ nat ) )
& ( ( X491
= ( n_pl @ X490 @ ( esk6_2 @ X490 @ X491 ) ) )
| ~ $true
| $true
| ( X490 = X491 )
| ~ $true
| ~ ( in @ X491 @ nat )
| ~ ( in @ X490 @ nat ) )
& ( $true
| ~ $true
| $true
| ( X490 = X491 )
| ~ $true
| ~ ( in @ X491 @ nat )
| ~ ( in @ X490 @ nat ) )
& ( ( in @ ( esk6_2 @ X490 @ X491 ) @ nat )
| ~ $true
| ( in @ ( esk5_2 @ X490 @ X491 ) @ nat )
| ~ $true
| $true
| ~ $true
| ~ ( in @ X491 @ nat )
| ~ ( in @ X490 @ nat ) )
& ( ( X491
= ( n_pl @ X490 @ ( esk6_2 @ X490 @ X491 ) ) )
| ~ $true
| ( in @ ( esk5_2 @ X490 @ X491 ) @ nat )
| ~ $true
| $true
| ~ $true
| ~ ( in @ X491 @ nat )
| ~ ( in @ X490 @ nat ) )
& ( $true
| ~ $true
| ( in @ ( esk5_2 @ X490 @ X491 ) @ nat )
| ~ $true
| $true
| ~ $true
| ~ ( in @ X491 @ nat )
| ~ ( in @ X490 @ nat ) )
& ( ( in @ ( esk6_2 @ X490 @ X491 ) @ nat )
| ~ $true
| ( X490
= ( n_pl @ X491 @ ( esk5_2 @ X490 @ X491 ) ) )
| ~ $true
| $true
| ~ $true
| ~ ( in @ X491 @ nat )
| ~ ( in @ X490 @ nat ) )
& ( ( X491
= ( n_pl @ X490 @ ( esk6_2 @ X490 @ X491 ) ) )
| ~ $true
| ( X490
= ( n_pl @ X491 @ ( esk5_2 @ X490 @ X491 ) ) )
| ~ $true
| $true
| ~ $true
| ~ ( in @ X491 @ nat )
| ~ ( in @ X490 @ nat ) )
& ( $true
| ~ $true
| ( X490
= ( n_pl @ X491 @ ( esk5_2 @ X490 @ X491 ) ) )
| ~ $true
| $true
| ~ $true
| ~ ( in @ X491 @ nat )
| ~ ( in @ X490 @ nat ) )
& ( ( in @ ( esk6_2 @ X490 @ X491 ) @ nat )
| ~ $true
| $true
| ~ $true
| $true
| ~ $true
| ~ ( in @ X491 @ nat )
| ~ ( in @ X490 @ nat ) )
& ( ( X491
= ( n_pl @ X490 @ ( esk6_2 @ X490 @ X491 ) ) )
| ~ $true
| $true
| ~ $true
| $true
| ~ $true
| ~ ( in @ X491 @ nat )
| ~ ( in @ X490 @ nat ) )
& ( $true
| ~ $true
| $true
| ~ $true
| $true
| ~ $true
| ~ ( in @ X491 @ nat )
| ~ ( in @ X490 @ nat ) )
& ( ( in @ ( esk6_2 @ X490 @ X491 ) @ nat )
| ~ $true
| $true
| $true
| ~ $true
| ~ ( in @ X491 @ nat )
| ~ ( in @ X490 @ nat ) )
& ( ( X491
= ( n_pl @ X490 @ ( esk6_2 @ X490 @ X491 ) ) )
| ~ $true
| $true
| $true
| ~ $true
| ~ ( in @ X491 @ nat )
| ~ ( in @ X490 @ nat ) )
& ( $true
| ~ $true
| $true
| $true
| ~ $true
| ~ ( in @ X491 @ nat )
| ~ ( in @ X490 @ nat ) )
& ( ~ ( in @ X494 @ nat )
| ( X490
!= ( n_pl @ X491 @ X494 ) )
| ~ $true
| ~ $true
| ( X490 != X491 )
| ~ $true
| ~ $true
| ~ ( in @ X491 @ nat )
| ~ ( in @ X490 @ nat ) )
& ( $true
| ~ $true
| ( X490 != X491 )
| ~ $true
| ~ $true
| ~ ( in @ X491 @ nat )
| ~ ( in @ X490 @ nat ) )
& ( ~ ( in @ X496 @ nat )
| ( X491
!= ( n_pl @ X490 @ X496 ) )
| ~ $true
| ~ $true
| ~ ( in @ X495 @ nat )
| ( X490
!= ( n_pl @ X491 @ X495 ) )
| ~ $true
| ~ $true
| ~ $true
| ~ $true
| ~ ( in @ X491 @ nat )
| ~ ( in @ X490 @ nat ) )
& ( $true
| ~ $true
| ~ ( in @ X495 @ nat )
| ( X490
!= ( n_pl @ X491 @ X495 ) )
| ~ $true
| ~ $true
| ~ $true
| ~ $true
| ~ ( in @ X491 @ nat )
| ~ ( in @ X490 @ nat ) )
& ( ~ ( in @ X496 @ nat )
| ( X491
!= ( n_pl @ X490 @ X496 ) )
| ~ $true
| ~ $true
| $true
| ~ $true
| ~ $true
| ~ $true
| ~ ( in @ X491 @ nat )
| ~ ( in @ X490 @ nat ) )
& ( $true
| ~ $true
| $true
| ~ $true
| ~ $true
| ~ $true
| ~ ( in @ X491 @ nat )
| ~ ( in @ X490 @ nat ) )
& ( ~ ( in @ X497 @ nat )
| ( X491
!= ( n_pl @ X490 @ X497 ) )
| ~ $true
| ( X490 != X491 )
| ~ $true
| ~ $true
| ~ $true
| ~ $true
| ~ ( in @ X491 @ nat )
| ~ ( in @ X490 @ nat ) )
& ( $true
| ( X490 != X491 )
| ~ $true
| ~ $true
| ~ $true
| ~ $true
| ~ ( in @ X491 @ nat )
| ~ ( in @ X490 @ nat ) )
& ( $true
| ~ $true
| ~ $true
| ~ $true
| ~ ( in @ X491 @ nat )
| ~ ( in @ X490 @ nat ) )
& ( $true
| ~ $true
| ~ $true
| ~ ( in @ X491 @ nat )
| ~ ( in @ X490 @ nat ) )
& ( $true
| ~ $true
| ~ ( in @ X491 @ nat )
| ~ ( in @ X490 @ nat ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_56])])])])])]) ).
thf(c_0_59,negated_conjecture,
~ ! [X344: $i] :
( ( in @ X344 @ nat )
=> ! [X343: $i] :
( ( in @ X343 @ nat )
=> ( ( ( ( ! [X341: $i] :
( ( in @ X341 @ nat )
=> ( ( X344
= ( n_pl @ X343 @ X341 ) )
=> ~ $true ) )
=> ~ $true )
=> ~ $true )
=> ( X344 = X343 ) )
=> ( ( ! [X342: $i] :
( ( in @ X342 @ nat )
=> ( ( X343
= ( n_pl @ X344 @ X342 ) )
=> ~ $true ) )
=> ~ $true )
=> ~ $true ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz10c])]),c_0_25]),c_0_32]),c_0_57]),c_0_54]) ).
thf(c_0_60,plain,
! [X1: $i,X4: $i,X5: $i] :
( ~ ( in @ X1 @ nat )
| ( X4
!= ( n_pl @ X5 @ X1 ) )
| ~ $true
| ( X5 != X4 )
| ~ $true
| ~ $true
| ~ $true
| ~ $true
| ~ ( in @ X4 @ nat )
| ~ ( in @ X5 @ nat ) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
thf(c_0_61,negated_conjecture,
( ( in @ esk1_0 @ nat )
& ( in @ esk2_0 @ nat )
& ( ( in @ esk3_0 @ nat )
| ~ $true
| ( esk1_0 = esk2_0 ) )
& ( ( esk1_0
= ( n_pl @ esk2_0 @ esk3_0 ) )
| ~ $true
| ( esk1_0 = esk2_0 ) )
& ( $true
| ~ $true
| ( esk1_0 = esk2_0 ) )
& ( $true
| ( esk1_0 = esk2_0 ) )
& ( ( in @ esk4_0 @ nat )
| ~ $true )
& ( ( esk2_0
= ( n_pl @ esk1_0 @ esk4_0 ) )
| ~ $true )
& ( $true
| ~ $true )
& $true ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_59])])])])]) ).
thf(c_0_62,plain,
! [X5: $i,X4: $i,X1: $i] :
( ( X4 != X5 )
| ( X4
!= ( n_pl @ X5 @ X1 ) )
| ~ ( in @ X5 @ nat )
| ~ ( in @ X4 @ nat )
| ~ ( in @ X1 @ nat ) ),
inference(cn,[status(thm)],[c_0_60]) ).
thf(c_0_63,negated_conjecture,
( ( esk2_0
= ( n_pl @ esk1_0 @ esk4_0 ) )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
thf(c_0_64,negated_conjecture,
( ( in @ esk4_0 @ nat )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
thf(c_0_65,plain,
! [X1: $i,X4: $i,X6: $i,X5: $i] :
( ~ ( in @ X1 @ nat )
| ( X4
!= ( n_pl @ X5 @ X1 ) )
| ~ $true
| ~ $true
| ~ ( in @ X6 @ nat )
| ( X5
!= ( n_pl @ X4 @ X6 ) )
| ~ $true
| ~ $true
| ~ $true
| ~ $true
| ~ ( in @ X4 @ nat )
| ~ ( in @ X5 @ nat ) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
thf(c_0_66,negated_conjecture,
( ( esk1_0
= ( n_pl @ esk2_0 @ esk3_0 ) )
| ( esk1_0 = esk2_0 )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
thf(c_0_67,plain,
! [X1: $i,X4: $i] :
( ( ( n_pl @ X1 @ X4 )
!= X1 )
| ~ ( in @ ( n_pl @ X1 @ X4 ) @ nat )
| ~ ( in @ X1 @ nat )
| ~ ( in @ X4 @ nat ) ),
inference(er,[status(thm)],[c_0_62]) ).
thf(c_0_68,negated_conjecture,
( esk2_0
= ( n_pl @ esk1_0 @ esk4_0 ) ),
inference(cn,[status(thm)],[c_0_63]) ).
thf(c_0_69,negated_conjecture,
in @ esk2_0 @ nat,
inference(split_conjunct,[status(thm)],[c_0_61]) ).
thf(c_0_70,negated_conjecture,
in @ esk1_0 @ nat,
inference(split_conjunct,[status(thm)],[c_0_61]) ).
thf(c_0_71,negated_conjecture,
in @ esk4_0 @ nat,
inference(cn,[status(thm)],[c_0_64]) ).
thf(c_0_72,negated_conjecture,
( ( in @ esk3_0 @ nat )
| ( esk1_0 = esk2_0 )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
thf(c_0_73,plain,
! [X6: $i,X5: $i,X4: $i,X1: $i] :
( ( X5
!= ( n_pl @ X4 @ X6 ) )
| ( X4
!= ( n_pl @ X5 @ X1 ) )
| ~ ( in @ X6 @ nat )
| ~ ( in @ X5 @ nat )
| ~ ( in @ X4 @ nat )
| ~ ( in @ X1 @ nat ) ),
inference(cn,[status(thm)],[c_0_65]) ).
thf(c_0_74,negated_conjecture,
( ( esk2_0 = esk1_0 )
| ( esk1_0
= ( n_pl @ esk2_0 @ esk3_0 ) ) ),
inference(cn,[status(thm)],[c_0_66]) ).
thf(c_0_75,negated_conjecture,
esk1_0 != esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]),c_0_70]),c_0_71])]) ).
thf(c_0_76,negated_conjecture,
( ( esk2_0 = esk1_0 )
| ( in @ esk3_0 @ nat ) ),
inference(cn,[status(thm)],[c_0_72]) ).
thf(c_0_77,plain,
! [X1: $i,X4: $i,X5: $i] :
( ( ( n_pl @ ( n_pl @ X1 @ X4 ) @ X5 )
!= X1 )
| ~ ( in @ ( n_pl @ X1 @ X4 ) @ nat )
| ~ ( in @ X4 @ nat )
| ~ ( in @ X1 @ nat )
| ~ ( in @ X5 @ nat ) ),
inference(er,[status(thm)],[c_0_73]) ).
thf(c_0_78,negated_conjecture,
( ( n_pl @ esk2_0 @ esk3_0 )
= esk1_0 ),
inference(sr,[status(thm)],[c_0_74,c_0_75]) ).
thf(c_0_79,negated_conjecture,
in @ esk3_0 @ nat,
inference(sr,[status(thm)],[c_0_76,c_0_75]) ).
thf(c_0_80,negated_conjecture,
! [X1: $i] :
( ( ( n_pl @ esk1_0 @ X1 )
!= esk2_0 )
| ~ ( in @ X1 @ nat ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_70]),c_0_79]),c_0_69])]) ).
thf(c_0_81,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_68]),c_0_71])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.15 % Problem : NUM652^4 : TPTP v8.1.2. Released v7.1.0.
% 0.16/0.17 % Command : run_E %s %d THM
% 0.18/0.38 % Computer : n012.cluster.edu
% 0.18/0.38 % Model : x86_64 x86_64
% 0.18/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.38 % Memory : 8042.1875MB
% 0.18/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.38 % CPULimit : 300
% 0.18/0.38 % WCLimit : 300
% 0.18/0.38 % DateTime : Fri May 3 09:06:40 EDT 2024
% 0.18/0.38 % CPUTime :
% 0.38/0.54 Running higher-order theorem proving
% 0.38/0.54 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.z32LRPxeQy/E---3.1_17846.p
% 0.40/0.66 # Type mismatch in argument #1 of indeq @ ($not @ db(4)) @ ($db_lam @ db(0) @ ($db_lam @ db(0) @ ($@_var @ db(6) @ db(1) @ db(0)))) @ db(3) @ (d_11_i @ ($not @ db(4)) @ ($db_lam @ db(0) @ ($db_lam @ db(0) @ ($@_var @ db(6) @ db(1) @ db(0)))) @ db(3) @ db(2) @ db(1)) @ db(0): expected $i but got $o
% 0.40/0.66 eprover: Type error
% 0.40/0.66 # Version: 3.1.0-ho
% 0.40/0.66 # Preprocessing class: HSLMSMSSLLLCHSA.
% 0.40/0.66 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.66 # Starting lpo1_fix with 900s (3) cores
% 0.40/0.66 # Starting full_lambda_9 with 300s (1) cores
% 0.40/0.66 # Starting almost_fo_4 with 300s (1) cores
% 0.40/0.66 # Starting new_ho_9 with 300s (1) cores
% 0.40/0.66 # Starting pre_casc_4 with 300s (1) cores
% 0.40/0.66 # Starting ho_unfolding_6 with 300s (1) cores
% 0.40/0.66 # full_lambda_9 with pid 17997 completed with status 0
% 0.40/0.66 # Result found by full_lambda_9
% 0.40/0.66 # Preprocessing class: HSLMSMSSLLLCHSA.
% 0.40/0.66 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.66 # Starting lpo1_fix with 900s (3) cores
% 0.40/0.66 # Starting full_lambda_9 with 300s (1) cores
% 0.40/0.66 # SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.40/0.66 # Search class: HGHSM-FSLM32-DHSMMSBN
% 0.40/0.66 # partial match(1): HGHSM-FSLM32-MHSMMSBN
% 0.40/0.66 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.40/0.66 # Starting full_lambda_5 with 25s (1) cores
% 0.40/0.66 # full_lambda_5 with pid 18020 completed with status 0
% 0.40/0.66 # Result found by full_lambda_5
% 0.40/0.66 # Preprocessing class: HSLMSMSSLLLCHSA.
% 0.40/0.66 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.66 # Starting lpo1_fix with 900s (3) cores
% 0.40/0.66 # Starting full_lambda_9 with 300s (1) cores
% 0.40/0.66 # SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.40/0.66 # Search class: HGHSM-FSLM32-DHSMMSBN
% 0.40/0.66 # partial match(1): HGHSM-FSLM32-MHSMMSBN
% 0.40/0.66 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.40/0.66 # Starting full_lambda_5 with 25s (1) cores
% 0.40/0.66 # Preprocessing time : 0.008 s
% 0.40/0.66 # Presaturation interreduction done
% 0.40/0.66
% 0.40/0.66 # Proof found!
% 0.40/0.66 # SZS status Theorem
% 0.40/0.66 # SZS output start CNFRefutation
% See solution above
% 0.40/0.66 # Parsed axioms : 351
% 0.40/0.66 # Removed by relevancy pruning/SinE : 242
% 0.40/0.66 # Initial clauses : 316
% 0.40/0.66 # Removed in clause preprocessing : 172
% 0.40/0.66 # Initial clauses in saturation : 144
% 0.40/0.66 # Processed clauses : 233
% 0.40/0.66 # ...of these trivial : 4
% 0.40/0.66 # ...subsumed : 25
% 0.40/0.66 # ...remaining for further processing : 204
% 0.40/0.66 # Other redundant clauses eliminated : 27
% 0.40/0.66 # Clauses deleted for lack of memory : 0
% 0.40/0.66 # Backward-subsumed : 2
% 0.40/0.66 # Backward-rewritten : 1
% 0.40/0.66 # Generated clauses : 172
% 0.40/0.66 # ...of the previous two non-redundant : 157
% 0.40/0.66 # ...aggressively subsumed : 0
% 0.40/0.66 # Contextual simplify-reflections : 5
% 0.40/0.66 # Paramodulations : 130
% 0.40/0.66 # Factorizations : 0
% 0.40/0.66 # NegExts : 0
% 0.40/0.66 # Equation resolutions : 30
% 0.40/0.66 # Disequality decompositions : 0
% 0.40/0.66 # Total rewrite steps : 63
% 0.40/0.66 # ...of those cached : 52
% 0.40/0.66 # Propositional unsat checks : 0
% 0.40/0.66 # Propositional check models : 0
% 0.40/0.66 # Propositional check unsatisfiable : 0
% 0.40/0.66 # Propositional clauses : 0
% 0.40/0.66 # Propositional clauses after purity: 0
% 0.40/0.66 # Propositional unsat core size : 0
% 0.40/0.66 # Propositional preprocessing time : 0.000
% 0.40/0.66 # Propositional encoding time : 0.000
% 0.40/0.66 # Propositional solver time : 0.000
% 0.40/0.66 # Success case prop preproc time : 0.000
% 0.40/0.66 # Success case prop encoding time : 0.000
% 0.40/0.66 # Success case prop solver time : 0.000
% 0.40/0.66 # Current number of processed clauses : 57
% 0.40/0.66 # Positive orientable unit clauses : 17
% 0.40/0.66 # Positive unorientable unit clauses: 0
% 0.40/0.66 # Negative unit clauses : 7
% 0.40/0.66 # Non-unit-clauses : 33
% 0.40/0.66 # Current number of unprocessed clauses: 187
% 0.40/0.66 # ...number of literals in the above : 664
% 0.40/0.66 # Current number of archived formulas : 0
% 0.40/0.66 # Current number of archived clauses : 126
% 0.40/0.66 # Clause-clause subsumption calls (NU) : 3467
% 0.40/0.66 # Rec. Clause-clause subsumption calls : 489
% 0.40/0.66 # Non-unit clause-clause subsumptions : 27
% 0.40/0.66 # Unit Clause-clause subsumption calls : 42
% 0.40/0.66 # Rewrite failures with RHS unbound : 0
% 0.40/0.66 # BW rewrite match attempts : 1
% 0.40/0.66 # BW rewrite match successes : 1
% 0.40/0.66 # Condensation attempts : 0
% 0.40/0.66 # Condensation successes : 0
% 0.40/0.66 # Termbank termtop insertions : 47739
% 0.40/0.66 # Search garbage collected termcells : 15432
% 0.40/0.66
% 0.40/0.66 # -------------------------------------------------
% 0.40/0.66 # User time : 0.074 s
% 0.40/0.66 # System time : 0.015 s
% 0.40/0.66 # Total time : 0.090 s
% 0.40/0.66 # Maximum resident set size: 4584 pages
% 0.40/0.66
% 0.40/0.66 # -------------------------------------------------
% 0.40/0.66 # User time : 0.086 s
% 0.40/0.66 # System time : 0.016 s
% 0.40/0.66 # Total time : 0.102 s
% 0.40/0.66 # Maximum resident set size: 2212 pages
% 0.40/0.66 % E---3.1 exiting
% 0.40/0.67 % E exiting
%------------------------------------------------------------------------------